|
In computational geometry, a well-separated pair decomposition (WSPD) of a set of points , is a sequence of pairs of sets , such that each pair is well-separated, and for each two distinct points , there exists precisely one pair which separates the two. The graph induced by a well-separated pair decomposition can serve as a k-spanner of the complete Euclidean graph, and is useful in approximating solutions to several problems pertaining to this. == Definition == Let be two disjoint sets of points in , denote the axis-aligned minimum bounding box for the points in , and denote the separation factor. We consider and to be well-separated, if for each of and there exists a d-ball of radius containing it, such that the two spheres have a minimum distance of at least . We consider a sequence of well-separated pairs of subsets of , to be a well-separated pair decomposition (WSPD) of if for any two distinct points , there exists precisely one , , such that either * and , or * and .〔 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Well-separated pair decomposition」の詳細全文を読む スポンサード リンク
|